Efficient Local Search for Euclidean Path-Difference Median Trees
نویسندگان
چکیده
منابع مشابه
An Efficient Local Search Algorithm for k-Median Problem
The k-median problem is one of the NP-hard combinatorial optimization problems. It falls into the general class of clustering problem and has application in the field of classification and data mining. One has confirmed that local search technique is the most effective and simplest method for designing the algorithms for k-median problem, and has been looking for the more efficient algorithms w...
متن کاملLocal Search Heuristics for k - median
In the k-median and facility location problems, we are given two sets: F , the set of facilities and C, the set of clients. There is a specified distance cij ≥ 0 (forming a metric) between every pair i, j ∈ F ∪C. The goal is to identify a subset of facilities S ⊆ F and to serve the clients in C by the facilities in S, such that the cost function is minimized. Formally, the k-median problem is d...
متن کاملEfficient Algorithms for Two Generalized 2-Median Problems on Trees
The p-median problem on a tree T is to find a set S of p vertices on T that minimize the sum of distances from T’s vertices to S. For this problem, Tamir [14] had an O(pn)-time algorithm, while Gavish and Sridhar [6] had an O(nlog n)-time algorithm for the case of p=2. In this paper, we study two generalizations of the 2-median problem, which are obtained by imposing constraints on a 2-median: ...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملEfficient Multiway Radix Search Trees
We present a new scheme for building static search trees, using multiway radix search. We apply this method to the problem of code generation for switch statements in imperative languages. For sparse case sets, the method has an advantage over existing methods, empirically requiring fewer than three branches for the average search. We give timing results that show that in practice our method ru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2019
ISSN: 1545-5963,1557-9964,2374-0043
DOI: 10.1109/tcbb.2017.2763137